The Königsberg Bridge Problem and the Friendship Theorem
نویسنده
چکیده
This development provides a formalization of undirected graphs and simple graphs, which are based on Benedikt Nordhoff and Peter Lammich’s simple formalization of labelled directed graphs [4] in the archive. Then, with our formalization of graphs, we have shown both necessary and sufficient conditions for Eulerian trails and circuits [2] as well as the fact that the Königsberg Bridge problem does not have a solution. In addition, we have also shown the Friendship Theorem in simple graphs[1, 3].
منابع مشابه
Strategic Planning for the National Bridge Stock of Iran
The National Bridge Stock of Iran consists of about 330,000 bridges, of which around 50% are older than 30 years. Since 2010, Iran Road Maintenance & Transportation Organization has started implementing a comprehensive Bridge Management System in order to manage this aged stock efficiently. To predict future conditions of bridge stock, a heuristic numerical method is presented. This methodology...
متن کاملSteering a quantum system over a Schrödinger bridge
We outline a new approach to the steering problem for quantum systems relying on Nelson’s stochastic mechanics and on the theory of Schrödinger bridges. The method is illustrated by working out a simple Gaussian example.
متن کاملPresentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کاملQuantum Schrödinger Bridges
we develop a simplified version of a variational principle within Nelson stochas-tic mechanics that produces the von Neumann wave packet reduction after a position measurement. This stochastic control problem parallels, with a different kinematics, the problem of the Schrödinger bridge. This gives a profound meaning to what was observed by Schrödinger in 1931 concerning Schrödinger bridges: " M...
متن کاملThe Friendship Problem on Graphs
In this paper we provide a purely combinatorial proof of the Friendship Theorem, which has been first proven by P. Erdös et al. by using also algebraic methods. Moreover, we generalize this theorem in a natural way, assuming that every pair of nodes occupies ≥ 2 common neighbors. We prove that every graph, which satisfies this generalized -friendship condition, is a regular graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013